Distribution-Sensitive Binomial Queues
نویسنده
چکیده
A new priority queue structure is introduced, for which the amortized time to insert a new element isO(1) while that for the minimumextraction is O(logK). K is the average, taken over all the deleted elements x, of the number of elements that are inserted during the lifespan of x and are still in the heap when x is removed. Several applications of our structure are mentioned.
منابع مشابه
Longest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملAn Alternative to the Beta-Binomial Distribution with Application in Developmental Toxicology
The beta-binomial distribution is resulted when the probability of success per trial in the binomial distribution varies in successive trials and the mixing distribution is from the beta family. For experiments with binary outcomes, often it may happen that observations exhibit some extra binomial variation and occur in clusters. In such experiments the beta-binomial distribution can generally ...
متن کاملOptimal Purely Functional Priority Queues
Brodal recently introduced the first implementation of imperative priority queues to support findMin, insert, and meld in O(1) worst-case time, and deleteMin in O(log n) worst-case time. These bounds are asymptotically optimal among all comparison-based priority queues. In this paper, we adapt Brodal’s data structure to a purely functional setting. In doing so, we both simplify the data structu...
متن کاملEstimation of parameter of proportion in Binomial Distribution Using Adjusted Prior Distribution
Historically, various methods were suggested for the estimation of Bernoulli and Binomial distributions parameter. One of the suggested methods is the Bayesian method, which is based on employing prior distribution. Their sound selection on parameter space play a crucial role in reducing posterior Bayesian estimator error. At times, large scale of the parametric changes on parameter space bring...
متن کاملTheoretical and practical efficiency of priority queues
This is a study of the theoretical and practical efficiency of priority queues. The priority queue is an old and well studied data structure on which a great deal of theoretical and practical work has already been done. A priority queue can be realised in many ways, some of the most commonly used data structures for this are binary heaps and binomial queues. In this thesis the efficiency of pri...
متن کامل